Clumsy packings with polyominoes
نویسندگان
چکیده
For a set D of polyominoes, a packing of the plane with D is a maximal set of copies of polyominoes from D that are not overlapping. A packing with smallest density is called clumsy packing. We give an example of a set D such that any clumsy packing is aperiodic. In addition, we compute the smallest possible density of a clumsy packing when D consist of a single polyomino of a given size and show that one could always construct a periodic packing arbitrarily close in density to the clumsy packing.
منابع مشابه
Packing polyominoes clumsily
For a set D of polyominoes, a packing of the plane with D is a maximal set of copies of polyominoes from D that are not overlapping. A packing with smallest density is called a clumsy packing. We give an example of a set D such that any clumsy packing is aperiodic. In addition, we compute the smallest possible density of a clumsy packing when D consists of a single polyomino of a given size and...
متن کاملExactly solved models of polyominoes and polygons
This chapter deals with the exact enumeration of certain classes of selfavoiding polygons and polyominoes on the square lattice. We present three general approaches that apply to many classes of polyominoes. The common principle to all of them is a recursive description of the polyominoes which then translates into a functional equation satisfied by the generating function. The first approach a...
متن کاملPolyominoes with Nearly Convex Columns: an Undirected Model
Column-convex polyominoes were introduced in 1950’s by Temperley, a mathematical physicist working on “lattice gases”. By now, column-convex polyominoes are a popular and well-understood model. There exist several generalizations of column-convex polyominoes. However, the enumeration by area has been done for only one of the said generalizations, namely for multi-directed animals. In this paper...
متن کاملReconstruction of 2-convex polyominoes
There are many notions of discrete convexity of polyominoes (namely hvconvex [1], Q-convex [2], L-convex polyominoes [5]) and each one has been deeply studied. One natural notion of convexity on the discrete plane leads to the definition of the class of hv-convex polyominoes, that is polyominoes with consecutive cells in rows and columns. In [1] and [6], it has been shown how to reconstruct in ...
متن کاملEnumeration of generalized polyominoes
As a generalization of polyominoes we consider edge-to-edge connected nonoverlapping unions of regular k-gons. For n ≤ 4 we determine formulas for the number ak(n) of generalized polyominoes consisting of n regular k-gons. Additionally we give a table of the numbers ak(n) for small k and n obtained by computer enumeration. We finish with some open problems for k-polyominoes.
متن کامل